Distributed Path Computation Using DIV Algorithm

Continuously Distributed Path Estimation by Using DIV

Paths with loops, even transient ones ,can pose significant stability problems in networks. Some earlier approaches like Shortest path routing (Dijkstra),Flooding, Flowbased routing, Distance vector routing(OSPF),Link state routing(Bellmen-Ford),Hierarchical routing, Broadcast routing, Multicast routing have problems maintaining the balance between node delays and link delays. We present a new ...

Distributed Path Consensus Algorithm

Path planning methods based on discrete graph searches are highly effective in dealing with large-scale environments, arbitrarily shaped obstacles, frequent map updates and complex cost functions. When it comes to planning for teams of coupled agents however, typical graph searchbased planning techniques quickly become infeasible due to the exponential growth of the dimensionality of the joint ...

Computation-Scalable Multi-Path Motion Estimation Algorithm

Controlling the computational complexity to balance video quality and computation power consumption in motion estimation is a significant issue. This paper proposes a fast multi-path motion estimation algorithm for achieving computational complexity reduction as well as controllable computation. First, an enhanced interested diamond search pattern with search point reduction is proposed. In add...

An 'All Pairs Shortest Path' Distributed Algorithm Using 2n² Messages

Efficient Distributed Algorithm for RWA Using Path Protection

A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such formulations become computationally intractable for larger networks. In this paper, we present two heuristic algorithms for dynamic lightpath allocation, using both dedicated and shared path protection. The first is a...